//输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。 
//
// 
//
// 示例 1： 
//
// 输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
//输出：[1,2,3,6,9,8,7,4,5]
// 
//
// 示例 2： 
//
// 输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
//输出：[1,2,3,4,8,12,11,10,9,5,6,7]
// 
//
// 
//
// 限制： 
//
// 
// 0 <= matrix.length <= 100 
// 0 <= matrix[i].length <= 100 
// 
//
// 注意：本题与主站 54 题相同：https://leetcode-cn.com/problems/spiral-matrix/ 
// Related Topics 数组 矩阵 模拟 👍 412 👎 0


package leetcode.editor.cn;

import java.util.ArrayList;
import java.util.List;

//Java：顺时针打印矩阵
public class ShunShiZhenDaYinJuZhenLcof {
    public static void main(String[] args) {
        Solution solution = new ShunShiZhenDaYinJuZhenLcof().new Solution();
        // TO TEST
        solution.spiralOrder(new int[][]{
                {1, 2, 3}, {4, 5, 6}, {7, 8, 9}
        });
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int[] spiralOrder(int[][] matrix) {
            int m = matrix.length;
            if (m == 0)
                return new int[]{};
            int n = matrix[0].length;
            List<Integer> list = new ArrayList<>();

            // 递归处理，先走外面一圈，在走里面一圈

            int count = m * n;
            int[] result = new int[count];
            for (int l = 0; l < count; l++) {
                result[l] = list.get(l);
            }
            return result;
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}
